Effective Recognizability and Model Checking of Reactive Fiffo Automata
نویسندگان
چکیده
Our work intends to verify reactive systems with event memorization speciied with the reactive language Electre. For this, we deene a particular behavioral model for Electre programs , Reactive Fiio Automata (RFAs), which is close to Fifo Automata. Intuitively, a RFA is the model of a reactive system which may store event occurrences that must not be immediately taken into account. We show that, contrarily to lossy systems where the reachability set is recognizable but not eeectively computable, (1) the reachability set of a RFA is recognizable, and (2) it is eeectively computable. Moreover, we also study the relationships between RFAs and Finite Automata and we prove that (3) from a trace language point of view, inclusions between RFAs and Finite Automata are undecidable and (4) the linear temporal logic LTL on states without the temporal operator next is decidable for RFAs, while LTL on transitions is undecidable.
منابع مشابه
Fly-automata, model-checking and recognizability
The Recognizability Theorem states that if a set of finite graphs is definable by a monadic second-order (MSO) sentence, then it is recognizable with respect to the graph algebra upon which the definition of clique-width is based. Recognizability is an algebraic notion, defined in terms of congruences that can also be formulated by means of finite automata on the terms that describe the conside...
متن کاملDecidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizability by tree automata of the reachability relation. The tree automata approach and the transition logics we use allow a smooth and general treatment of parameterized model checking for PA. This approach is extended to h...
متن کاملFREC delivrable 8: Algebraic classification of recognizable sets of λ-terms
This document constitutes the 8th deliverable of the FREC ANR project. So as to foster our understanding the nature of finite recognizability in the context of λY -calculus, this report presents the construction of a model that allows one to account for some computational properties of λY -terms: here namely the convergence of βδ-conversion. The computational properties of finite state models a...
متن کاملComputing Simulations on Finite and In nite Graphs y
We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the re nement and veri cation of reactive systems. For nite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m n). For e ectively presented in nite graphs, we present a symbolic similarity-checking proc...
متن کاملReactive Safety
The distinction between safety and liveness properties is a fundamental classification with immediate implications on the feasibility and complexity of various monitoring, model checking, and synthesis problems. In this paper, we revisit the notion of safety for reactive systems, i.e., for systems whose behavior is characterized by the interplay of uncontrolled environment inputs and controlled...
متن کامل